A Grassmann graph embedding framework for gait analysis
نویسندگان
چکیده
Gait recognition is important in a wide range of monitoring and surveillance applications. Gait information has often been used as evidence when other biometrics is indiscernible in the surveillance footage. Building on recent advances of the subspace-based approaches, we consider the problem of gait recognition on the Grassmann manifold. We show that by embedding the manifold into reproducing kernel Hilbert space and applying the mechanics of graph embedding on such manifold, significant performance improvement can be obtained. In this work, the gait recognition problem is studied in a unified way applicable for both supervised and unsupervised configurations. Sparse representation is further incorporated in the learning mechanism to adaptively harness the local structure of the data. Experiments demonstrate that the proposed method can tolerate variations in appearance for gait identification effectively.
منابع مشابه
Gait Recognition Based Online Person Identification in a Camera Network
In this paper, we propose a novel online multi-camera framework for person identification based on gait recognition using Grassmann Discriminant Analysis. We propose an online method wherein the gait space of individuals are created as they are tracked. The gait space is view invariant and the recognition process is carried out in a distributed manner. We assume that only a fixed known set of p...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملPlücker Embedding of Cyclic Orbit Codes
Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Plücker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.
متن کاملPlücker Embedding of Cyclic Orbit Codes
Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Plücker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words. 1. Introduction. In network coding one is looking at the transmission of information through a directed graph with possibly several senders and several receivers [1]. One c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014